翻訳と辞書 Words near each other ・ Hilda Koronel ・ Hilda Kuper ・ Hilda Käkikoski ・ Hilda Lane ・ Hilda Lewis ・ Hilda Leyel ・ Hilda Lindley ・ Hilda Lindley House ・ Hilbert's nineteenth problem ・ Hilbert's ninth problem ・ Hilbert's Nullstellensatz ・ Hilbert's paradox of the Grand Hotel ・ Hilbert's problems ・ Hilbert's program ・ Hilbert's second problem ・ Hilbert's seventeenth problem ・ Hilbert's seventh problem ・ Hilbert's sixteenth problem ・ Hilbert's sixth problem ・ Hilbert's syzygy theorem ・ Hilbert's tenth problem ・ Hilbert's theorem ・ Hilbert's theorem (differential geometry) ・ Hilbert's Theorem 90 ・ Hilbert's third problem ・ Hilbert's thirteenth problem ・ Hilbert's twelfth problem ・ Hilbert's twentieth problem ・ Hilbert's twenty-first problem ・ Hilbert's twenty-fourth problem Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Hilbert's seventeenth problem ： ウィキペディア英語版 Hilbert's seventeenth problem Hilbert's seventeenth problem is one of the 23 Hilbert problems set out in a celebrated list compiled in 1900 by David Hilbert. It concerns the expression of positive definite rational functions as sums of quotients of squares. The original question may be stated as: * Given a multivariate polynomial that takes only non-negative values over the reals, can it be represented as a sum of squares of rational functions? This was solved in the affirmative, in 1927, by Emil Artin, for positive definite functions over the reals or more generally real-closed fields. An algorithmic solution was found by Charles Delzell in 1984. A result of Albrecht Pfister shows that a positive semidefinite form in ''n'' variables can be expressed as a sum of 2''n'' squares.〔Lam (2005) p.391〕 Dubois showed in 1967 that the answer is negative in general for ordered fields. In this case one can say that a positive polynomial is a sum of weighted squares of rational functions with positive coefficients.〔Lorenz (2008) p.16〕 A generalization to the matrix case (matrices with polynomial function entries that are always positive semidefinite can be expressed as sum of squares of symmetric matrices with rational function entries) was given by Gondard, Ribenboim and Procesi, Schacher, with an elementary proof given by Hillar and Nie. The formulation of the question takes into account that there are polynomials, for example〔Marie-Françoise Roy. The role of Hilbert's problems in real algebraic geometry. Proceedings of the ninth EWM Meeting, Loccum, Germany 1999〕 :$f(x,y,z)=z^6+x^4y^2+x^2y^4-3x^2y^2z^2\; \backslash ,$ which are non-negative over reals and yet which cannot be represented as a sum of squares of other polynomials, as Hilbert had shown in 1888 but without giving an example: the first explicit example was found by Motzkin in 1966. Explicit sufficient conditions for a polynomial to be a sum of squares of other polynomials have been found.〔()〕 However every real nonnegative polynomial can be approximated as closely as desired (in the $l\_1$-norm of its coefficient vector) by a sequence of polynomials that are sums of squares of polynomials. It is an open question what is the smallest number :$v(n,d),\; \backslash ,$ such that any ''n''-variate, non-negative polynomial of degree ''d'' can be written as sum of at most $v(n,d)$ square rational functions over the reals. The best known result () is :$v(n,d)\backslash leq2^n,\; \backslash ,$ due to Pfister in 1967.〔 In complex analysis the Hermitian analogue, requiring the squares to be squared norms of holomorphic mappings, is somewhat more complicated, but true for positive polynomials by a result of Quillen. The result of Pfister on the other hand fails in the Hermitian case, that is there is no bound on the number of squares required, see D'Angelo–Lebl. ==See also== * Polynomial SOS 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Hilbert's seventeenth problem」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.